CONGESTION CONTROL ALGORITHM FOR MESSAGE ROUTING IN STRUCTURED PEER-TO-PEER NETWORKS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Message Routing in Pure Peer-to-Peer Networks

Pure peer-to-peer systems are loosely coupled, highly autonomous systems with a simple architecture, typically without hierarchy. Often, flooding-based routing mechanisms are used for sending messages through the overlay (application level) network. Due to the limited scalability and high network load experiences, the paper suggests an improvement to reduce the traffic and overall performance: ...

متن کامل

Semantic Routing for Structured Peer-to-Peer Networks

During this work a simulator of a mechanism of searching in collaborative application is made to manage the content through the WWW with structured Peer-to-Peer networks. The principal contribution of this work is one mechanism that joins a metadata in the queries that are sent by the DHT Routing. The Semantic Routing proposed reduces the number of the average hops to reach an object or a docum...

متن کامل

Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks

Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. They provide efficient and fault-tolerant routing, object location and load balancing within a selforganizing overlay network. One important aspect of these systems is how they exploit network proximity in the underlying...

متن کامل

Routing in Structured Peer - to - Peer Overlays

Anonymous Routing in Structured Peer-to-Peer Overlays

متن کامل

Locality in structured peer-to-peer networks

Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems provide efficient mechanisms for resource placement and location. A key distinguishing feature of current DHT systems, such as Chord, Pastry, CAN and Tapestry, is the way they handle locality in the underlying network. Topology-based node identifier assignment, proximity routing, and proximity neighbor sel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer Science and Cybernetics

سال: 2018

ISSN: 1813-9663,1813-9663

DOI: 10.15625/1813-9663/34/2/12723